Left Termination of the query pattern
goal(g)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

tree(nil).
tree(node(L, X, R)) :- ','(tree(L), tree(R)).
s2t(s(X), node(T, Y, T)) :- s2t(X, T).
s2t(s(X), node(nil, Y, T)) :- s2t(X, T).
s2t(s(X), node(T, Y, nil)) :- s2t(X, T).
s2t(s(X), node(nil, Y, nil)).
s2t(0, nil).
goal(X) :- ','(s2t(X, T), tree(T)).

Query: goal(g)

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph ICLP10.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: goal(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: goal(T1), SCOPE: 1, CLAUSE: 7\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: ','(s2t(T3, X3), tree(X3))\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 2 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 3 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 4 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 5 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 6\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 2\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 3 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 4 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 5 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 6\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: ','(s2t(T8, X27), tree(node(X27, X28, X27)))\n\nT8 is ground\nX27 is free\nX28 is free", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: s2t(T8, X27)\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: tree(node(T10, X28, T10))\n\nX28 is free", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: s2t(T8, X27), SCOPE: 3, CLAUSE: 2 | s2t(T8, X27), SCOPE: 3, CLAUSE: 3 | s2t(T8, X27), SCOPE: 3, CLAUSE: 4 | s2t(T8, X27), SCOPE: 3, CLAUSE: 5 | s2t(T8, X27), SCOPE: 3, CLAUSE: 6\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: s2t(T8, X27), SCOPE: 3, CLAUSE: 2\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: s2t(T8, X27), SCOPE: 3, CLAUSE: 3 | s2t(T8, X27), SCOPE: 3, CLAUSE: 4 | s2t(T8, X27), SCOPE: 3, CLAUSE: 5 | s2t(T8, X27), SCOPE: 3, CLAUSE: 6\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: s2t(T16, X62)\n\nT16 is ground\nX62 is free", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: s2t(T8, X27), SCOPE: 3, CLAUSE: 3\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: s2t(T8, X27), SCOPE: 3, CLAUSE: 4 | s2t(T8, X27), SCOPE: 3, CLAUSE: 5 | s2t(T8, X27), SCOPE: 3, CLAUSE: 6\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: s2t(T22, X93)\n\nT22 is ground\nX93 is free", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: s2t(T8, X27), SCOPE: 3, CLAUSE: 4\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: s2t(T8, X27), SCOPE: 3, CLAUSE: 5 | s2t(T8, X27), SCOPE: 3, CLAUSE: 6\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: s2t(T28, X122)\n\nT28 is ground\nX122 is free", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: s2t(T8, X27), SCOPE: 3, CLAUSE: 5\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: s2t(T8, X27), SCOPE: 3, CLAUSE: 6\n\nT8 is ground\nX27 is free", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: tree(node(T10, X28, T10)), SCOPE: 4, CLAUSE: 0 | tree(node(T10, X28, T10)), SCOPE: 4, CLAUSE: 1\n\nX28 is free", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: tree(node(T10, X28, T10)), SCOPE: 4, CLAUSE: 1\n\nX28 is free", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: ','(tree(T39), tree(T39))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: tree(T39)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: tree(T40)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: tree(T40), SCOPE: 5, CLAUSE: 0 | tree(T40), SCOPE: 5, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: tree(T40), SCOPE: 5, CLAUSE: 0\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: tree(T40), SCOPE: 5, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: ','(tree(T50), tree(T51))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: tree(T50)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: tree(T52)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 3\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 4 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 5 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 6\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: ','(s2t(T57, X189), tree(node(nil, X188, X189)))\n\nT57 is ground\nX188 is free\nX189 is free", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: s2t(T57, X189)\n\nT57 is ground\nX189 is free", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: tree(node(nil, X188, T59))\n\nX188 is free", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 4\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 5 | ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 6\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: ','(s2t(T65, X223), tree(node(X223, X224, nil)))\n\nT65 is ground\nX223 is free\nX224 is free", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: s2t(T65, X223)\n\nT65 is ground\nX223 is free", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: tree(node(T67, X224, nil))\n\nX224 is free", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 5\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
60 [label="60: ','(s2t(T3, X3), tree(X3)), SCOPE: 2, CLAUSE: 6\n\nT3 is ground\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
61 [label="61: tree(node(nil, X249, nil))\n\nX249 is free", fontsize=16, style=filled, fillcolor=lightyellow];
62 [label="62: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
63 [label="63: tree(node(nil, X249, nil)), SCOPE: 6, CLAUSE: 0 | tree(node(nil, X249, nil)), SCOPE: 6, CLAUSE: 1\n\nX249 is free", fontsize=16, style=filled, fillcolor=lightyellow];
64 [label="64: tree(node(nil, X249, nil)), SCOPE: 6, CLAUSE: 1\n\nX249 is free", fontsize=16, style=filled, fillcolor=lightyellow];
65 [label="65: ','(tree(nil), tree(nil))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
66 [label="66: tree(nil)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
67 [label="67: tree(nil)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
68 [label="68: tree(nil), SCOPE: 7, CLAUSE: 0 | tree(nil), SCOPE: 7, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
69 [label="69: tree(nil), SCOPE: 7, CLAUSE: 0\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
70 [label="70: tree(nil), SCOPE: 7, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
71 [label="71: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
72 [label="72: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
73 [label="73: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
74 [label="74: tree(nil)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
75 [label="75: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
76 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 76 [arrowhead = none ];
76 -> 2;

77 [label="ONLY EVAL with clause\ngoal(X2) :- ','(s2t(X2, X3), tree(X3)).\nand substitutionT1 -> T3,\nX2 -> T3", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 77 [arrowhead = none ];
77 -> 3;

78 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
3 -> 78 [arrowhead = none ];
78 -> 4;

79 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
4 -> 79 [arrowhead = none ];
79 -> 5;

80 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
4 -> 80 [arrowhead = none ];
80 -> 6;

81 [label="EVAL with clause\ns2t(s(X24), node(X25, X26, X25)) :- s2t(X24, X25).\nand substitutionX24 -> T8,\nT3 -> s(T8),\nX25 -> X27,\nX26 -> X28,\nX3 -> node(X27, X28, X27)", fontsize=14, style = filled, fillcolor = lightblue];
5 -> 81 [arrowhead = none ];
81 -> 7;

82 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
5 -> 82 [arrowhead = none ];
82 -> 8;

83 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
6 -> 83 [arrowhead = none ];
83 -> 47;

84 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
6 -> 84 [arrowhead = none ];
84 -> 48;

85 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
7 -> 85 [arrowhead = none ];
85 -> 9;

86 [label="SPLIT 2\nnew knowledge:\nT8 is ground\nreplacements:X27 -> T10", fontsize=14, style = filled, fillcolor = violet];
7 -> 86 [arrowhead = none ];
86 -> 10;

87 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
9 -> 87 [arrowhead = none ];
87 -> 11;

88 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
10 -> 88 [arrowhead = none ];
88 -> 32;

89 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
11 -> 89 [arrowhead = none ];
89 -> 12;

90 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
11 -> 90 [arrowhead = none ];
90 -> 13;

91 [label="EVAL with clause\ns2t(s(X59), node(X60, X61, X60)) :- s2t(X59, X60).\nand substitutionX59 -> T16,\nT8 -> s(T16),\nX60 -> X62,\nX61 -> X63,\nX27 -> node(X62, X63, X62)", fontsize=14, style = filled, fillcolor = lightblue];
12 -> 91 [arrowhead = none ];
91 -> 14;

92 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
12 -> 92 [arrowhead = none ];
92 -> 15;

93 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
13 -> 93 [arrowhead = none ];
93 -> 16;

94 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
13 -> 94 [arrowhead = none ];
94 -> 17;

95 [label="INSTANCE with matching:\nT8 -> T16\nX27 -> X62", fontsize=14, style = filled, fillcolor = lightgrey];
14 -> 95 [arrowhead = none , style=dashed];
95 -> 9[style=dashed];

96 [label="EVAL with clause\ns2t(s(X89), node(nil, X90, X91)) :- s2t(X89, X91).\nand substitutionX89 -> T22,\nT8 -> s(T22),\nX90 -> X92,\nX91 -> X93,\nX27 -> node(nil, X92, X93)", fontsize=14, style = filled, fillcolor = lightblue];
16 -> 96 [arrowhead = none ];
96 -> 18;

97 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
16 -> 97 [arrowhead = none ];
97 -> 19;

98 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
17 -> 98 [arrowhead = none ];
98 -> 20;

99 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
17 -> 99 [arrowhead = none ];
99 -> 21;

100 [label="INSTANCE with matching:\nT8 -> T22\nX27 -> X93", fontsize=14, style = filled, fillcolor = lightgrey];
18 -> 100 [arrowhead = none , style=dashed];
100 -> 9[style=dashed];

101 [label="EVAL with clause\ns2t(s(X119), node(X120, X121, nil)) :- s2t(X119, X120).\nand substitutionX119 -> T28,\nT8 -> s(T28),\nX120 -> X122,\nX121 -> X123,\nX27 -> node(X122, X123, nil)", fontsize=14, style = filled, fillcolor = lightblue];
20 -> 101 [arrowhead = none ];
101 -> 22;

102 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
20 -> 102 [arrowhead = none ];
102 -> 23;

103 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
21 -> 103 [arrowhead = none ];
103 -> 24;

104 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
21 -> 104 [arrowhead = none ];
104 -> 25;

105 [label="INSTANCE with matching:\nT8 -> T28\nX27 -> X122", fontsize=14, style = filled, fillcolor = lightgrey];
22 -> 105 [arrowhead = none , style=dashed];
105 -> 9[style=dashed];

106 [label="EVAL with clause\ns2t(s(X141), node(nil, X142, nil)).\nand substitutionX141 -> T34,\nT8 -> s(T34),\nX142 -> X143,\nX27 -> node(nil, X143, nil)", fontsize=14, style = filled, fillcolor = lightblue];
24 -> 106 [arrowhead = none ];
106 -> 26;

107 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
24 -> 107 [arrowhead = none ];
107 -> 27;

108 [label="EVAL with clause\ns2t(0, nil).\nand substitutionT8 -> 0,\nX27 -> nil", fontsize=14, style = filled, fillcolor = lightblue];
25 -> 108 [arrowhead = none ];
108 -> 29;

109 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
25 -> 109 [arrowhead = none ];
109 -> 30;

110 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
26 -> 110 [arrowhead = none ];
110 -> 28;

111 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
29 -> 111 [arrowhead = none ];
111 -> 31;

112 [label="BACKTRACK\nfor clause: tree(nil)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
32 -> 112 [arrowhead = none ];
112 -> 33;

113 [label="ONLY EVAL with clause\ntree(node(X152, X153, X154)) :- ','(tree(X152), tree(X154)).\nand substitutionT10 -> T39,\nX152 -> T39,\nX28 -> X155,\nX153 -> X155,\nX154 -> T39,\nT38 -> T39", fontsize=14, style = filled, fillcolor = lightblue];
33 -> 113 [arrowhead = none ];
113 -> 34;

114 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
34 -> 114 [arrowhead = none ];
114 -> 35;

115 [label="SPLIT 2\nreplacements:T39 -> T40", fontsize=14, style = filled, fillcolor = violet];
34 -> 115 [arrowhead = none ];
115 -> 36;

116 [label="INSTANCE with matching:\nT40 -> T39", fontsize=14, style = filled, fillcolor = lightgrey];
35 -> 116 [arrowhead = none , style=dashed];
116 -> 36[style=dashed];

117 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
36 -> 117 [arrowhead = none ];
117 -> 37;

118 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
37 -> 118 [arrowhead = none ];
118 -> 38;

119 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
37 -> 119 [arrowhead = none ];
119 -> 39;

120 [label="EVAL with clause\ntree(nil).\nand substitutionT40 -> nil", fontsize=14, style = filled, fillcolor = lightblue];
38 -> 120 [arrowhead = none ];
120 -> 40;

121 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
38 -> 121 [arrowhead = none ];
121 -> 41;

122 [label="EVAL with clause\ntree(node(X162, X163, X164)) :- ','(tree(X162), tree(X164)).\nand substitutionX162 -> T50,\nX163 -> T48,\nX164 -> T51,\nT40 -> node(T50, T48, T51),\nT47 -> T50,\nT49 -> T51", fontsize=14, style = filled, fillcolor = lightblue];
39 -> 122 [arrowhead = none ];
122 -> 43;

123 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
39 -> 123 [arrowhead = none ];
123 -> 44;

124 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
40 -> 124 [arrowhead = none ];
124 -> 42;

125 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
43 -> 125 [arrowhead = none ];
125 -> 45;

126 [label="SPLIT 2\nreplacements:T51 -> T52", fontsize=14, style = filled, fillcolor = violet];
43 -> 126 [arrowhead = none ];
126 -> 46;

127 [label="INSTANCE with matching:\nT40 -> T50", fontsize=14, style = filled, fillcolor = lightgrey];
45 -> 127 [arrowhead = none , style=dashed];
127 -> 36[style=dashed];

128 [label="INSTANCE with matching:\nT40 -> T52", fontsize=14, style = filled, fillcolor = lightgrey];
46 -> 128 [arrowhead = none , style=dashed];
128 -> 36[style=dashed];

129 [label="EVAL with clause\ns2t(s(X185), node(nil, X186, X187)) :- s2t(X185, X187).\nand substitutionX185 -> T57,\nT3 -> s(T57),\nX186 -> X188,\nX187 -> X189,\nX3 -> node(nil, X188, X189)", fontsize=14, style = filled, fillcolor = lightblue];
47 -> 129 [arrowhead = none ];
129 -> 49;

130 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
47 -> 130 [arrowhead = none ];
130 -> 50;

131 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
48 -> 131 [arrowhead = none ];
131 -> 53;

132 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
48 -> 132 [arrowhead = none ];
132 -> 54;

133 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
49 -> 133 [arrowhead = none ];
133 -> 51;

134 [label="SPLIT 2\nnew knowledge:\nT57 is ground\nreplacements:X189 -> T59", fontsize=14, style = filled, fillcolor = violet];
49 -> 134 [arrowhead = none ];
134 -> 52;

135 [label="INSTANCE with matching:\nT8 -> T57\nX27 -> X189", fontsize=14, style = filled, fillcolor = lightgrey];
51 -> 135 [arrowhead = none , style=dashed];
135 -> 9[style=dashed];

136 [label="INSTANCE with matching:\nT40 -> node(nil, X188, T59)", fontsize=14, style = filled, fillcolor = lightgrey];
52 -> 136 [arrowhead = none , style=dashed];
136 -> 36[style=dashed];

137 [label="EVAL with clause\ns2t(s(X220), node(X221, X222, nil)) :- s2t(X220, X221).\nand substitutionX220 -> T65,\nT3 -> s(T65),\nX221 -> X223,\nX222 -> X224,\nX3 -> node(X223, X224, nil)", fontsize=14, style = filled, fillcolor = lightblue];
53 -> 137 [arrowhead = none ];
137 -> 55;

138 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
53 -> 138 [arrowhead = none ];
138 -> 56;

139 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
54 -> 139 [arrowhead = none ];
139 -> 59;

140 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
54 -> 140 [arrowhead = none ];
140 -> 60;

141 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
55 -> 141 [arrowhead = none ];
141 -> 57;

142 [label="SPLIT 2\nnew knowledge:\nT65 is ground\nreplacements:X223 -> T67", fontsize=14, style = filled, fillcolor = violet];
55 -> 142 [arrowhead = none ];
142 -> 58;

143 [label="INSTANCE with matching:\nT8 -> T65\nX27 -> X223", fontsize=14, style = filled, fillcolor = lightgrey];
57 -> 143 [arrowhead = none , style=dashed];
143 -> 9[style=dashed];

144 [label="INSTANCE with matching:\nT40 -> node(T67, X224, nil)", fontsize=14, style = filled, fillcolor = lightgrey];
58 -> 144 [arrowhead = none , style=dashed];
144 -> 36[style=dashed];

145 [label="EVAL with clause\ns2t(s(X247), node(nil, X248, nil)).\nand substitutionX247 -> T73,\nT3 -> s(T73),\nX248 -> X249,\nX3 -> node(nil, X249, nil)", fontsize=14, style = filled, fillcolor = lightblue];
59 -> 145 [arrowhead = none ];
145 -> 61;

146 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
59 -> 146 [arrowhead = none ];
146 -> 62;

147 [label="EVAL with clause\ns2t(0, nil).\nand substitutionT3 -> 0,\nX3 -> nil", fontsize=14, style = filled, fillcolor = lightblue];
60 -> 147 [arrowhead = none ];
147 -> 74;

148 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
60 -> 148 [arrowhead = none ];
148 -> 75;

149 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
61 -> 149 [arrowhead = none ];
149 -> 63;

150 [label="BACKTRACK\nfor clause: tree(nil)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
63 -> 150 [arrowhead = none ];
150 -> 64;

151 [label="ONLY EVAL with clause\ntree(node(X258, X259, X260)) :- ','(tree(X258), tree(X260)).\nand substitutionX258 -> nil,\nX249 -> X261,\nX259 -> X261,\nX260 -> nil", fontsize=14, style = filled, fillcolor = lightblue];
64 -> 151 [arrowhead = none ];
151 -> 65;

152 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
65 -> 152 [arrowhead = none ];
152 -> 66;

153 [label="SPLIT 2", fontsize=14, style = filled, fillcolor = violet];
65 -> 153 [arrowhead = none ];
153 -> 67;

154 [label="INSTANCE", fontsize=14, style = filled, fillcolor = lightgrey];
66 -> 154 [arrowhead = none , style=dashed];
154 -> 67[style=dashed];

155 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
67 -> 155 [arrowhead = none ];
155 -> 68;

156 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
68 -> 156 [arrowhead = none ];
156 -> 69;

157 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
68 -> 157 [arrowhead = none ];
157 -> 70;

158 [label="ONLY EVAL with clause\ntree(nil).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
69 -> 158 [arrowhead = none ];
158 -> 71;

159 [label="BACKTRACK\nfor clause: tree(node(L, X, R)) :- ','(tree(L), tree(R))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
70 -> 159 [arrowhead = none ];
159 -> 73;

160 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
71 -> 160 [arrowhead = none ];
160 -> 72;

161 [label="INSTANCE", fontsize=14, style = filled, fillcolor = lightgrey];
74 -> 161 [arrowhead = none , style=dashed];
161 -> 67[style=dashed];

}

(2) Obligation:

Clauses:

s2tA(s(T16), node(X62, X63, X62)) :- s2tA(T16, X62).
s2tA(s(T22), node(nil, X92, X93)) :- s2tA(T22, X93).
s2tA(s(T28), node(X122, X123, nil)) :- s2tA(T28, X122).
s2tA(s(T34), node(nil, X143, nil)).
s2tA(0, nil).
treeB(nil).
treeB(node(T50, T48, T51)) :- treeB(T50).
treeB(node(T50, T48, T52)) :- ','(treeB(T50), treeB(T52)).
treeC.
goalD(s(T8)) :- s2tA(T8, X27).
goalD(s(T8)) :- ','(s2tA(T8, T39), treeB(T39)).
goalD(s(T8)) :- ','(s2tA(T8, T40), ','(treeB(T40), treeB(T40))).
goalD(s(T57)) :- s2tA(T57, X189).
goalD(s(T57)) :- ','(s2tA(T57, T59), treeB(node(nil, X188, T59))).
goalD(s(T65)) :- s2tA(T65, X223).
goalD(s(T65)) :- ','(s2tA(T65, T67), treeB(node(T67, X224, nil))).
goalD(s(T73)) :- treeC.
goalD(s(T73)) :- ','(treeC, treeC).
goalD(0) :- treeC.

Query: goalD(g)

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
goalD_in: (b)
s2tA_in: (b,f)
treeB_in: (b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

GOALD_IN_G(s(T8)) → U7_G(T8, s2tA_in_ga(T8, X27))
GOALD_IN_G(s(T8)) → S2TA_IN_GA(T8, X27)
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → U1_GA(T16, X62, X63, s2tA_in_ga(T16, X62))
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → S2TA_IN_GA(T16, X62)
S2TA_IN_GA(s(T22), node(nil, X92, X93)) → U2_GA(T22, X92, X93, s2tA_in_ga(T22, X93))
S2TA_IN_GA(s(T22), node(nil, X92, X93)) → S2TA_IN_GA(T22, X93)
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → U3_GA(T28, X122, X123, s2tA_in_ga(T28, X122))
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → S2TA_IN_GA(T28, X122)
GOALD_IN_G(s(T8)) → U8_G(T8, s2tA_in_ga(T8, T39))
U8_G(T8, s2tA_out_ga(T8, T39)) → U9_G(T8, treeB_in_g(T39))
U8_G(T8, s2tA_out_ga(T8, T39)) → TREEB_IN_G(T39)
TREEB_IN_G(node(T50, T48, T51)) → U4_G(T50, T48, T51, treeB_in_g(T50))
TREEB_IN_G(node(T50, T48, T51)) → TREEB_IN_G(T50)
TREEB_IN_G(node(T50, T48, T52)) → U5_G(T50, T48, T52, treeB_in_g(T50))
U5_G(T50, T48, T52, treeB_out_g(T50)) → U6_G(T50, T48, T52, treeB_in_g(T52))
U5_G(T50, T48, T52, treeB_out_g(T50)) → TREEB_IN_G(T52)
GOALD_IN_G(s(T8)) → U10_G(T8, s2tA_in_ga(T8, T40))
U10_G(T8, s2tA_out_ga(T8, T40)) → U11_G(T8, T40, treeB_in_g(T40))
U10_G(T8, s2tA_out_ga(T8, T40)) → TREEB_IN_G(T40)
U11_G(T8, T40, treeB_out_g(T40)) → U12_G(T8, treeB_in_g(T40))
U11_G(T8, T40, treeB_out_g(T40)) → TREEB_IN_G(T40)
GOALD_IN_G(s(T57)) → U13_G(T57, s2tA_in_ga(T57, X189))
GOALD_IN_G(s(T57)) → U14_G(T57, s2tA_in_ga(T57, T59))
U14_G(T57, s2tA_out_ga(T57, T59)) → U15_G(T57, treeB_in_g(node(nil, X188, T59)))
U14_G(T57, s2tA_out_ga(T57, T59)) → TREEB_IN_G(node(nil, X188, T59))
GOALD_IN_G(s(T65)) → U16_G(T65, s2tA_in_ga(T65, X223))
GOALD_IN_G(s(T65)) → U17_G(T65, s2tA_in_ga(T65, T67))
U17_G(T65, s2tA_out_ga(T65, T67)) → U18_G(T65, treeB_in_g(node(T67, X224, nil)))
U17_G(T65, s2tA_out_ga(T65, T67)) → TREEB_IN_G(node(T67, X224, nil))
GOALD_IN_G(s(T73)) → U19_G(T73, treeC_in_)
GOALD_IN_G(s(T73)) → TREEC_IN_
U19_G(T73, treeC_out_) → U20_G(T73, treeC_in_)
U19_G(T73, treeC_out_) → TREEC_IN_
GOALD_IN_G(0) → U21_G(treeC_in_)
GOALD_IN_G(0) → TREEC_IN_

The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)
GOALD_IN_G(x1)  =  GOALD_IN_G(x1)
U7_G(x1, x2)  =  U7_G(x2)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)
U1_GA(x1, x2, x3, x4)  =  U1_GA(x4)
U2_GA(x1, x2, x3, x4)  =  U2_GA(x4)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U8_G(x1, x2)  =  U8_G(x2)
U9_G(x1, x2)  =  U9_G(x2)
TREEB_IN_G(x1)  =  TREEB_IN_G(x1)
U4_G(x1, x2, x3, x4)  =  U4_G(x4)
U5_G(x1, x2, x3, x4)  =  U5_G(x3, x4)
U6_G(x1, x2, x3, x4)  =  U6_G(x4)
U10_G(x1, x2)  =  U10_G(x2)
U11_G(x1, x2, x3)  =  U11_G(x2, x3)
U12_G(x1, x2)  =  U12_G(x2)
U13_G(x1, x2)  =  U13_G(x2)
U14_G(x1, x2)  =  U14_G(x2)
U15_G(x1, x2)  =  U15_G(x2)
U16_G(x1, x2)  =  U16_G(x2)
U17_G(x1, x2)  =  U17_G(x2)
U18_G(x1, x2)  =  U18_G(x2)
U19_G(x1, x2)  =  U19_G(x2)
TREEC_IN_  =  TREEC_IN_
U20_G(x1, x2)  =  U20_G(x2)
U21_G(x1)  =  U21_G(x1)

We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GOALD_IN_G(s(T8)) → U7_G(T8, s2tA_in_ga(T8, X27))
GOALD_IN_G(s(T8)) → S2TA_IN_GA(T8, X27)
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → U1_GA(T16, X62, X63, s2tA_in_ga(T16, X62))
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → S2TA_IN_GA(T16, X62)
S2TA_IN_GA(s(T22), node(nil, X92, X93)) → U2_GA(T22, X92, X93, s2tA_in_ga(T22, X93))
S2TA_IN_GA(s(T22), node(nil, X92, X93)) → S2TA_IN_GA(T22, X93)
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → U3_GA(T28, X122, X123, s2tA_in_ga(T28, X122))
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → S2TA_IN_GA(T28, X122)
GOALD_IN_G(s(T8)) → U8_G(T8, s2tA_in_ga(T8, T39))
U8_G(T8, s2tA_out_ga(T8, T39)) → U9_G(T8, treeB_in_g(T39))
U8_G(T8, s2tA_out_ga(T8, T39)) → TREEB_IN_G(T39)
TREEB_IN_G(node(T50, T48, T51)) → U4_G(T50, T48, T51, treeB_in_g(T50))
TREEB_IN_G(node(T50, T48, T51)) → TREEB_IN_G(T50)
TREEB_IN_G(node(T50, T48, T52)) → U5_G(T50, T48, T52, treeB_in_g(T50))
U5_G(T50, T48, T52, treeB_out_g(T50)) → U6_G(T50, T48, T52, treeB_in_g(T52))
U5_G(T50, T48, T52, treeB_out_g(T50)) → TREEB_IN_G(T52)
GOALD_IN_G(s(T8)) → U10_G(T8, s2tA_in_ga(T8, T40))
U10_G(T8, s2tA_out_ga(T8, T40)) → U11_G(T8, T40, treeB_in_g(T40))
U10_G(T8, s2tA_out_ga(T8, T40)) → TREEB_IN_G(T40)
U11_G(T8, T40, treeB_out_g(T40)) → U12_G(T8, treeB_in_g(T40))
U11_G(T8, T40, treeB_out_g(T40)) → TREEB_IN_G(T40)
GOALD_IN_G(s(T57)) → U13_G(T57, s2tA_in_ga(T57, X189))
GOALD_IN_G(s(T57)) → U14_G(T57, s2tA_in_ga(T57, T59))
U14_G(T57, s2tA_out_ga(T57, T59)) → U15_G(T57, treeB_in_g(node(nil, X188, T59)))
U14_G(T57, s2tA_out_ga(T57, T59)) → TREEB_IN_G(node(nil, X188, T59))
GOALD_IN_G(s(T65)) → U16_G(T65, s2tA_in_ga(T65, X223))
GOALD_IN_G(s(T65)) → U17_G(T65, s2tA_in_ga(T65, T67))
U17_G(T65, s2tA_out_ga(T65, T67)) → U18_G(T65, treeB_in_g(node(T67, X224, nil)))
U17_G(T65, s2tA_out_ga(T65, T67)) → TREEB_IN_G(node(T67, X224, nil))
GOALD_IN_G(s(T73)) → U19_G(T73, treeC_in_)
GOALD_IN_G(s(T73)) → TREEC_IN_
U19_G(T73, treeC_out_) → U20_G(T73, treeC_in_)
U19_G(T73, treeC_out_) → TREEC_IN_
GOALD_IN_G(0) → U21_G(treeC_in_)
GOALD_IN_G(0) → TREEC_IN_

The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)
GOALD_IN_G(x1)  =  GOALD_IN_G(x1)
U7_G(x1, x2)  =  U7_G(x2)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)
U1_GA(x1, x2, x3, x4)  =  U1_GA(x4)
U2_GA(x1, x2, x3, x4)  =  U2_GA(x4)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x4)
U8_G(x1, x2)  =  U8_G(x2)
U9_G(x1, x2)  =  U9_G(x2)
TREEB_IN_G(x1)  =  TREEB_IN_G(x1)
U4_G(x1, x2, x3, x4)  =  U4_G(x4)
U5_G(x1, x2, x3, x4)  =  U5_G(x3, x4)
U6_G(x1, x2, x3, x4)  =  U6_G(x4)
U10_G(x1, x2)  =  U10_G(x2)
U11_G(x1, x2, x3)  =  U11_G(x2, x3)
U12_G(x1, x2)  =  U12_G(x2)
U13_G(x1, x2)  =  U13_G(x2)
U14_G(x1, x2)  =  U14_G(x2)
U15_G(x1, x2)  =  U15_G(x2)
U16_G(x1, x2)  =  U16_G(x2)
U17_G(x1, x2)  =  U17_G(x2)
U18_G(x1, x2)  =  U18_G(x2)
U19_G(x1, x2)  =  U19_G(x2)
TREEC_IN_  =  TREEC_IN_
U20_G(x1, x2)  =  U20_G(x2)
U21_G(x1)  =  U21_G(x1)

We have to consider all (P,R,Pi)-chains

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 29 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

TREEB_IN_G(node(T50, T48, T52)) → U5_G(T50, T48, T52, treeB_in_g(T50))
U5_G(T50, T48, T52, treeB_out_g(T50)) → TREEB_IN_G(T52)
TREEB_IN_G(node(T50, T48, T51)) → TREEB_IN_G(T50)

The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)
TREEB_IN_G(x1)  =  TREEB_IN_G(x1)
U5_G(x1, x2, x3, x4)  =  U5_G(x3, x4)

We have to consider all (P,R,Pi)-chains

(10) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(11) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

TREEB_IN_G(node(T50, T48, T52)) → U5_G(T50, T48, T52, treeB_in_g(T50))
U5_G(T50, T48, T52, treeB_out_g(T50)) → TREEB_IN_G(T52)
TREEB_IN_G(node(T50, T48, T51)) → TREEB_IN_G(T50)

The TRS R consists of the following rules:

treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))

The argument filtering Pi contains the following mapping:
node(x1, x2, x3)  =  node(x1, x3)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
TREEB_IN_G(x1)  =  TREEB_IN_G(x1)
U5_G(x1, x2, x3, x4)  =  U5_G(x3, x4)

We have to consider all (P,R,Pi)-chains

(12) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TREEB_IN_G(node(T50, T52)) → U5_G(T52, treeB_in_g(T50))
U5_G(T52, treeB_out_g) → TREEB_IN_G(T52)
TREEB_IN_G(node(T50, T51)) → TREEB_IN_G(T50)

The TRS R consists of the following rules:

treeB_in_g(nil) → treeB_out_g
treeB_in_g(node(T50, T51)) → U4_g(treeB_in_g(T50))
treeB_in_g(node(T50, T52)) → U5_g(T52, treeB_in_g(T50))
U4_g(treeB_out_g) → treeB_out_g
U5_g(T52, treeB_out_g) → U6_g(treeB_in_g(T52))
U6_g(treeB_out_g) → treeB_out_g

The set Q consists of the following terms:

treeB_in_g(x0)
U4_g(x0)
U5_g(x0, x1)
U6_g(x0)

We have to consider all (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• U5_G(T52, treeB_out_g) → TREEB_IN_G(T52)
  The graph contains the following edges 1 >= 1

• TREEB_IN_G(node(T50, T51)) → TREEB_IN_G(T50)
  The graph contains the following edges 1 > 1

• TREEB_IN_G(node(T50, T52)) → U5_G(T52, treeB_in_g(T50))
  The graph contains the following edges 1 > 1

(15) YES

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T22), node(nil, X92, X93)) → S2TA_IN_GA(T22, X93)
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → S2TA_IN_GA(T16, X62)
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → S2TA_IN_GA(T28, X122)

The TRS R consists of the following rules:

goalD_in_g(s(T8)) → U7_g(T8, s2tA_in_ga(T8, X27))
s2tA_in_ga(s(T16), node(X62, X63, X62)) → U1_ga(T16, X62, X63, s2tA_in_ga(T16, X62))
s2tA_in_ga(s(T22), node(nil, X92, X93)) → U2_ga(T22, X92, X93, s2tA_in_ga(T22, X93))
s2tA_in_ga(s(T28), node(X122, X123, nil)) → U3_ga(T28, X122, X123, s2tA_in_ga(T28, X122))
s2tA_in_ga(s(T34), node(nil, X143, nil)) → s2tA_out_ga(s(T34), node(nil, X143, nil))
s2tA_in_ga(0, nil) → s2tA_out_ga(0, nil)
U3_ga(T28, X122, X123, s2tA_out_ga(T28, X122)) → s2tA_out_ga(s(T28), node(X122, X123, nil))
U2_ga(T22, X92, X93, s2tA_out_ga(T22, X93)) → s2tA_out_ga(s(T22), node(nil, X92, X93))
U1_ga(T16, X62, X63, s2tA_out_ga(T16, X62)) → s2tA_out_ga(s(T16), node(X62, X63, X62))
U7_g(T8, s2tA_out_ga(T8, X27)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U8_g(T8, s2tA_in_ga(T8, T39))
U8_g(T8, s2tA_out_ga(T8, T39)) → U9_g(T8, treeB_in_g(T39))
treeB_in_g(nil) → treeB_out_g(nil)
treeB_in_g(node(T50, T48, T51)) → U4_g(T50, T48, T51, treeB_in_g(T50))
treeB_in_g(node(T50, T48, T52)) → U5_g(T50, T48, T52, treeB_in_g(T50))
U5_g(T50, T48, T52, treeB_out_g(T50)) → U6_g(T50, T48, T52, treeB_in_g(T52))
U6_g(T50, T48, T52, treeB_out_g(T52)) → treeB_out_g(node(T50, T48, T52))
U4_g(T50, T48, T51, treeB_out_g(T50)) → treeB_out_g(node(T50, T48, T51))
U9_g(T8, treeB_out_g(T39)) → goalD_out_g(s(T8))
goalD_in_g(s(T8)) → U10_g(T8, s2tA_in_ga(T8, T40))
U10_g(T8, s2tA_out_ga(T8, T40)) → U11_g(T8, T40, treeB_in_g(T40))
U11_g(T8, T40, treeB_out_g(T40)) → U12_g(T8, treeB_in_g(T40))
U12_g(T8, treeB_out_g(T40)) → goalD_out_g(s(T8))
goalD_in_g(s(T57)) → U13_g(T57, s2tA_in_ga(T57, X189))
U13_g(T57, s2tA_out_ga(T57, X189)) → goalD_out_g(s(T57))
goalD_in_g(s(T57)) → U14_g(T57, s2tA_in_ga(T57, T59))
U14_g(T57, s2tA_out_ga(T57, T59)) → U15_g(T57, treeB_in_g(node(nil, X188, T59)))
U15_g(T57, treeB_out_g(node(nil, X188, T59))) → goalD_out_g(s(T57))
goalD_in_g(s(T65)) → U16_g(T65, s2tA_in_ga(T65, X223))
U16_g(T65, s2tA_out_ga(T65, X223)) → goalD_out_g(s(T65))
goalD_in_g(s(T65)) → U17_g(T65, s2tA_in_ga(T65, T67))
U17_g(T65, s2tA_out_ga(T65, T67)) → U18_g(T65, treeB_in_g(node(T67, X224, nil)))
U18_g(T65, treeB_out_g(node(T67, X224, nil))) → goalD_out_g(s(T65))
goalD_in_g(s(T73)) → U19_g(T73, treeC_in_)
treeC_in_ → treeC_out_
U19_g(T73, treeC_out_) → goalD_out_g(s(T73))
U19_g(T73, treeC_out_) → U20_g(T73, treeC_in_)
U20_g(T73, treeC_out_) → goalD_out_g(s(T73))
goalD_in_g(0) → U21_g(treeC_in_)
U21_g(treeC_out_) → goalD_out_g(0)

The argument filtering Pi contains the following mapping:
goalD_in_g(x1)  =  goalD_in_g(x1)
s(x1)  =  s(x1)
U7_g(x1, x2)  =  U7_g(x2)
s2tA_in_ga(x1, x2)  =  s2tA_in_ga(x1)
U1_ga(x1, x2, x3, x4)  =  U1_ga(x4)
U2_ga(x1, x2, x3, x4)  =  U2_ga(x4)
U3_ga(x1, x2, x3, x4)  =  U3_ga(x4)
s2tA_out_ga(x1, x2)  =  s2tA_out_ga(x2)
node(x1, x2, x3)  =  node(x1, x3)
0  =  0
goalD_out_g(x1)  =  goalD_out_g
U8_g(x1, x2)  =  U8_g(x2)
U9_g(x1, x2)  =  U9_g(x2)
treeB_in_g(x1)  =  treeB_in_g(x1)
nil  =  nil
treeB_out_g(x1)  =  treeB_out_g
U4_g(x1, x2, x3, x4)  =  U4_g(x4)
U5_g(x1, x2, x3, x4)  =  U5_g(x3, x4)
U6_g(x1, x2, x3, x4)  =  U6_g(x4)
U10_g(x1, x2)  =  U10_g(x2)
U11_g(x1, x2, x3)  =  U11_g(x2, x3)
U12_g(x1, x2)  =  U12_g(x2)
U13_g(x1, x2)  =  U13_g(x2)
U14_g(x1, x2)  =  U14_g(x2)
U15_g(x1, x2)  =  U15_g(x2)
U16_g(x1, x2)  =  U16_g(x2)
U17_g(x1, x2)  =  U17_g(x2)
U18_g(x1, x2)  =  U18_g(x2)
U19_g(x1, x2)  =  U19_g(x2)
treeC_in_  =  treeC_in_
treeC_out_  =  treeC_out_
U20_g(x1, x2)  =  U20_g(x2)
U21_g(x1)  =  U21_g(x1)
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(17) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(18) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T22), node(nil, X92, X93)) → S2TA_IN_GA(T22, X93)
S2TA_IN_GA(s(T16), node(X62, X63, X62)) → S2TA_IN_GA(T16, X62)
S2TA_IN_GA(s(T28), node(X122, X123, nil)) → S2TA_IN_GA(T28, X122)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
node(x1, x2, x3)  =  node(x1, x3)
nil  =  nil
S2TA_IN_GA(x1, x2)  =  S2TA_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(19) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S2TA_IN_GA(s(T22)) → S2TA_IN_GA(T22)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(21) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• S2TA_IN_GA(s(T22)) → S2TA_IN_GA(T22)
  The graph contains the following edges 1 > 1

(22) YES